Blocking the Flow
نویسندگان
چکیده
منابع مشابه
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملthe effects of changing roughness on the flow structure in the bends
flow in natural river bends is a complex and turbulent phenomenon which affects the scour and sedimentations and causes an irregular bed topography on the bed. for the reason, the flow hydralics and the parameters which affect the flow to be studied and understand. in this study the effect of bed and wall roughness using the software fluent discussed in a sharp 90-degree flume bend with 40.3cm ...
A Simple IP Flow Blocking Model
Flow based networking can assist in addressing current performance issues in convergent IP networks and enable dynamic, real-time routing. The Scheme for Advanced Overflow Routing (SAPOR) is a method that enables flow based routing in IP networks. This paper presents an analytical model that allows the calculation of overflow probabilities for flows, transmitted via a bottleneck connection. The...
متن کاملan iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria
in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...
متن کاملAn Implementation of the Binary Blocking Flow Algorithm
Goldberg and Rao recently devised a new binary blocking ow algorithm for computing maximum ows in networks with integer capacities. We describe an implementation of variants of the binary blocking ow algorithm geared towards practical eeciency and report on preliminary experimental results obtained with our implementation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Index on Censorship
سال: 1977
ISSN: 0306-4220,1746-6067
DOI: 10.1177/030642207700600503